On the Efficiency of P Systems with Active Membranes and Two Polarizations

نویسندگان

  • Artiom Alhazov
  • Rudolf Freund
چکیده

We present an algorithm for deterministically deciding SAT in linear time by P systems with active membranes using only two polarizations and rules of types (a), (c), and (e). Moreover, various restrictions on the general form of the rules are considered: global, non-renaming, independent of the polarization, preserving it, changing it, producing two membranes with different polarizations, having exactly one or two objects in (each membrane of) the right-hand side, thus improving results from [1]. Several problems related to different combinations of these restrictions are formulated, too.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Computational Completeness of P Systems with Active Membranes and Two Polarizations

P systems with active membranes using only two electrical charges and only rules of types (a) and (c) assigned to at most two membranes are shown to be computationally complete – thus improving the previous result of this type from the point of view of the number of polarizations as well as with respect to the number of membranes. Allowing a special variant of rules of type (c) to delete symbol...

متن کامل

Polarizationless P Systems with One Active Membrane

The aim of this paper is to study the computational power of P systems with one active membrane without polarizations. For P systems with active membranes, it is known that computational completeness can be obtained with either of the following combinations of features: 1)two polarizations, 2)membrane creation and dissolution, 3)four membranes with three labels, membrane division and dissolutio...

متن کامل

Polarizationless P Systems with Active Membranes Working in the Minimally Parallel Mode

We investigate the computing power and the efficiency of P systems with active membranes without polarizations, working in the minimally parallel mode. We prove that such systems are computationally complete and able to solve NP-complete problems even when the rules are of a restricted form, e.g., for establishing computational completeness we only need rules handling single objects and no divi...

متن کامل

On the Computational Efficiency of Polarizationless Recognizer P Systems with Strong Division and Dissolution

Recognizer P systems with active membranes have proven to be very powerful computing devices, being able to solve NP-complete decision problems in a polynomial time. However such solutions usually exploit many powerful features, such as electrical charges (polarizations) associated to membranes, evolution rules, communication rules, and strong or weak forms of division rules. In this paper we c...

متن کامل

Minimal Parallelism and Number of Membrane Polarizations

It is known that the satisfiability problem (SAT) can be efficiently solved by a uniform family of P systems with active membranes with two polarizations working in a maximally parallel way. We study P systems with active membranes without non-elementary membrane division, working in minimally parallel way. The main question we address is what number of polarizations is sufficient for an effici...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004